package DP;

/**
 * @author 曹见朋
 * @create 2024-06-16-21:24
 */
public class Main718 {

    // TODO 718. 最长重复子数组
    public static int findLength(int[] nums1, int[] nums2) {
        int n1 = nums1.length;
        int n2 = nums2.length;
        int[][] dp = new int[n1 + 1][n2 + 1];
        int result = 0;
        for(int i = 1; i <= n1; i++){
            for(int j = 1; j <= n2; j++){
                if(nums1[i - 1] == nums2[j - 1]){
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                }
                result = Math.max(dp[i][j], result);
            }
        }
        return result;
    }

    public static void main(String[] args) {

        int[] nums1 = new int[]{1,2,3,2,1};
        int[] nums2 = new int[]{3,2,1,4,7};
        System.out.println(findLength(nums1, nums2));
    }
}
